Fast equality test for straight-line compressed strings
نویسندگان
چکیده
The paper describes a simple and fast randomized test for equality of grammar-compressed strings. The thorough running time analysis is done by applying a logarithmic cost measure.
منابع مشابه
Equality Testing of Compressed Strings
This paper gives a survey on efficient algorithms for checking equality of grammar-compressed strings, i.e., strings that are represented succinctly by so called straight-line programs.
متن کاملAn Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program
In this paper we study the problem of deciding whether a given compressed string contains a square. A string x is called a square if x = zz and z = u implies k = 1 and u = z. A string w is said to be square-free if no substrings of w are squares. Many efficient algorithms to test if a given string is square-free, have been developed so far. However, very little is known for testing square-freen...
متن کاملTesting Square-Freeness of Strings Compressed by Balanced Straight Line Program
In this paper we study the problem of deciding whether a given compressed string contains a square. A string x is called a square if x = zz and z = u implies k = 1 and u = z. A string w is said to be square-free if no substrings of w are squares. Many efficient algorithms to test if a given string is square-free, have been developed so far. However, very little is known for testing square-freen...
متن کاملAn Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs
In this paper we study the problem of deciding whether a given compressed string contains a square. A string x is called a square if x = zz and z = uk implies k = 1 and u = z. A string w is said to be square-free if no substrings of w are squares. However, very little is known for testing square-freeness of a given compressed string. In this paper, we give an O(max(n2,n log2 N))-time O(n2)-spac...
متن کاملThe Complexity of Two - DimensionalCompressed Pattern -
We consider the complexity of problems for highly compressed 2-dimensional texts: compressed pattern-matching (when the pattern is not compressed and the text is compressed) and fully compressed pattern-matching (when also the pattern is compressed). First we consider 2-dimensional compression in terms of straight-line programs, see 9]. It is a natural way for representing very highly compresse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 112 شماره
صفحات -
تاریخ انتشار 2012